Comparison of Blind Source Separation Algorithms

نویسندگان

  • Yan Li
  • David Powers
چکیده

A set of experiments are designed to evaluate and compare the performances of three well known blind source separation algorithms in this paper. The specific algorithms studied are two group of neural networks algorithms, Bell and Sejnowski’s infomax algorithm and Hyvärinen’s fixed-point family, and J. F. Cardoso’s joint approxomate diagonalization of eigen-matrices algorithm. In this paper, the algorithms are quantitively evaluated and compared using the three measures, MATLAB flops (floating point operations), the difference between the mixing and separating matrices and the signal-to-noise ratios of the separated signals in this paper. Key-Words: blind souce separation, information maximisation, fixed-point algorithm,JADE

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

متن کامل

Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

متن کامل

Performance Comparison of Combined Blind/non-blind Source Separation Algorithms

Source separation is becoming increasingly important in acoustical applications for spatial filtering. In the absence of any known source signals (blind case), a blind update equation similar to the natural gradient method [1] is presented, a derivative of which can be used in the case of known references (non-blind case). If some, but not all, source signals are known, blind-only algorithms ar...

متن کامل

Blind Signal Separation Using an Extended Infomax Algorithm

The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...

متن کامل

An Experimental Comparison of Neural Algorithms for Independent Component Analysis and Blind Separation

In this paper, we compare the performance of five prominent neural or adaptive algorithms designed for Independent Component Analysis (ICA) and blind source separation (BSS). In the first part of the study, we use artificial data for comparing the accuracy, convergence speed, computational load, and other relevant properties of the algorithms. In the second part, the algorithms are applied to t...

متن کامل

Blind Signal Separation Using an Extended Infomax Algorithm

The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000